| Vera T. Sós | |
|---|---|
| Born | September 11, 1930 Budapest |
| Nationality | Hungarian |
| Fields | Mathematics |
| Institutions | Eötvös Loránd University |
| Doctoral students | László Babai András Recski László Székely |
Vera T. Sós (born September 11, 1930 in Budapest) is a Hungarian mathematician, specializing in number theory and combinatorics. She was a student and close collaborator of both Paul Erdős and Alfréd Rényi. She also collaborated frequently with her husband Paul Turán, the famous analyst, number theorist, and combinatorist (the letter T in her name stands for Turán[1]). Until 1987, she worked at the Department of Analysis at the Eötvös Loránd University, Budapest. Since then, she has been employed by the Alfréd Rényi Institute of Mathematics.[2] She was elected a corresponding member (1985), member (1990) of the Hungarian Academy of Sciences.[3] In 1997, Sós was awarded the prestigious Széchenyi Prize.
One of her results is the Kővári–Sós–Turán theorem concerning the maximum possible number of edges in a bipartite graph that does not contain certain complete subgraphs. Another is the following so-called friendship theorem proved with Paul Erdõs and Alfréd Rényi: if, in a finite graph, any two vertices have exactly one common neighbor, then some vertex is joined to all others. In number theory, Sós proved the three distance theorem, conjectured by Hugo Steinhaus.